convex programming造句
例句與造句
- The convergence of an algorithm for the reverse convex programming
一類反凸規(guī)劃算法的收斂性 - The affine scaling algorithm for convex programming with linear constraints
線性約束凸規(guī)劃問題的仿尺度算法 - Convex programming problem
凸規(guī)劃問題 - Solving linearly constrained convex programming by potential reduction interior - point algorithm
求解線性約束凸規(guī)劃的勢下降內(nèi)點(diǎn)算法 - Finally , the relationships between generalized set - valued variational inclusion problems and non - convex programming are studied
最后研究了廣義集值變分包含問題與非凸規(guī)劃之間的關(guān)系。 - It's difficult to find convex programming in a sentence. 用convex programming造句挺難的
- Fifthly , the parameter control methods for solving convex programming , especially linear programming and convex quadratic programming , are discussed and its convergence iv is probed
五是研究了凸規(guī)劃包括線性規(guī)劃和凸二次規(guī)劃的參數(shù)控制算法及其收斂性。 - Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints , and prove the iteration complexity is polynomial
文摘:本文為框式約束的一類凸規(guī)劃提出了一個新的內(nèi)點(diǎn)算法，原始-對偶路徑跟蹤法，并證明了算法的迭代復(fù)雜性為多項式時間性 - The mathematical programming methods , both the method of moving asymptotes ( mma ) belonging to convex programming methods and the sequential linear programming method ( slp ) , were used to solving optimization problems
用移動漸進(jìn)線方法( mma )求解單目標(biāo)優(yōu)化問題，用序列線性規(guī)劃方法( slp )求解模糊目標(biāo)混合規(guī)劃問題。 - Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
最后，還證明了得到的凹規(guī)劃和反凸規(guī)劃的全局最優(yōu)解就是原問題的近似全局最優(yōu)解。 - Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed
文摘:給出了無界域上不定二次規(guī)劃的一個算法，該算法將不定二次規(guī)劃轉(zhuǎn)化為一系列凸二次規(guī)劃，并證明了算法的收斂性 - The generalized support vector machines ( gsvms ) was proposed by mangasarian , but it can not be degenerated to the standard svms . in fact , the former only consider the strict convex programming , while the latter considers the convex programming
Mangasarian提出廣義支持向量機(jī)，但不包含標(biāo)準(zhǔn)的支持向量機(jī)：前者研究一般的嚴(yán)格凸規(guī)劃問題，而后者針對的是特定的凸規(guī)劃問題。 - At the beginning of their research , they could transform some nonlinear programming into relevant dual , such transformation made some outcome almost similar to linear programming . but if they wanted meaningful results , they had to consider convex programming
在初期，他們發(fā)現(xiàn)可以將某些非線性規(guī)劃表述為一個相應(yīng)的對偶規(guī)劃，且有少量相似于線性規(guī)劃的結(jié)果，但如果希望得到有意義的結(jié)果，只能考慮凸規(guī)劃。 - The paper discusses convex programs with an additional reverse convex constraint and gives the properties of the global optimization about this problem . a branch - and - bound algorithm for solving this problem is constructed and the convergence properties of this algorithm is analysed
討論帶一個反凸約束的凸規(guī)劃問題.給出了整體最優(yōu)解的特性，利用此特性借助分枝定界方法，構(gòu)造出求該問題整體最優(yōu)解的算法，并進(jìn)行了收斂性分析 - In the progress of deducing the dual of these two problems using the knowledge of convex programming and generalized fenchel theory , you can find lagrange dual of the two programming by lagrange dual in nonlinear programming in this article
基于凸規(guī)劃知識和廣義的fenchel定理，作者推導(dǎo)出這兩類問題的凸對偶規(guī)劃。同時，發(fā)現(xiàn)由非線性規(guī)劃中l(wèi)agrange對偶可以獲得這兩類問題的lagrange對偶規(guī)劃，且推導(dǎo)過程中沒有涉及很深的數(shù)學(xué)知識，使得應(yīng)用更為廣泛。 - This paper consists of three parts as follows , 1 . a nonsmooth convex programming is relaxed to a smooth convex programming by using a cutting - plane , which is constructed by subgradient . an algorithm based on the cutting - plane is presented . in this way , a cutting plane algorithm and it ' s convergence for semide ? nite programming are provided
利用次微分的概念給出了一種非光滑凸規(guī)劃割平面的構(gòu)造技巧，找到了半定規(guī)劃可行域的一個支撐超平面，從而給出了求解半定規(guī)劃的一種割平面算法
更多例句： 下一頁